TSTP Solution File: SET586^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET586^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:12:13 EDT 2024
% Result : Theorem 0.15s 0.37s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 163 ( 64 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 172 ( 31 ~; 18 |; 30 &; 79 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 0 ^ 27 !; 18 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a > $o ).
thf(func_def_7,type,
sK3: a ).
thf(f31,plain,
$false,
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
$false = $true,
inference(superposition,[],[f20,f27]) ).
thf(f27,plain,
( ( sK2 @ sK3 )
= $true ),
inference(trivial_inequality_removal,[],[f25]) ).
thf(f25,plain,
( ( ( sK2 @ sK3 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f12,f13]) ).
thf(f13,plain,
( ( sK1 @ sK3 )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( $true
= ( sK0 @ sK3 ) )
& ( ( ( sK2 @ sK3 )
!= $true )
| ( $true
!= ( sK0 @ sK3 ) ) )
& ( ( sK1 @ sK3 )
= $true )
& ! [X4: a] :
( ( ( sK1 @ X4 )
!= $true )
| ( ( sK2 @ X4 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( ( X2 @ X3 )
!= $true )
| ( ( X0 @ X3 )
!= $true ) )
& ( ( X1 @ X3 )
= $true ) )
& ! [X4: a] :
( ( ( X1 @ X4 )
!= $true )
| ( ( X2 @ X4 )
= $true ) ) )
=> ( ? [X3: a] :
( ( ( sK0 @ X3 )
= $true )
& ( ( ( sK2 @ X3 )
!= $true )
| ( ( sK0 @ X3 )
!= $true ) )
& ( $true
= ( sK1 @ X3 ) ) )
& ! [X4: a] :
( ( ( sK1 @ X4 )
!= $true )
| ( ( sK2 @ X4 )
= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X3: a] :
( ( ( sK0 @ X3 )
= $true )
& ( ( ( sK2 @ X3 )
!= $true )
| ( ( sK0 @ X3 )
!= $true ) )
& ( $true
= ( sK1 @ X3 ) ) )
=> ( ( $true
= ( sK0 @ sK3 ) )
& ( ( ( sK2 @ sK3 )
!= $true )
| ( $true
!= ( sK0 @ sK3 ) ) )
& ( ( sK1 @ sK3 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( ( X2 @ X3 )
!= $true )
| ( ( X0 @ X3 )
!= $true ) )
& ( ( X1 @ X3 )
= $true ) )
& ! [X4: a] :
( ( ( X1 @ X4 )
!= $true )
| ( ( X2 @ X4 )
= $true ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X2: a > $o,X0: a > $o,X1: a > $o] :
( ? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ( ( ( X1 @ X4 )
!= $true )
| ( ( X2 @ X4 )
!= $true ) )
& ( ( X0 @ X4 )
= $true ) )
& ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X1 @ X3 )
= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X1: a > $o,X0: a > $o,X2: a > $o] :
( ? [X4: a] :
( ( ( ( X1 @ X4 )
!= $true )
| ( ( X2 @ X4 )
!= $true ) )
& ( ( X0 @ X4 )
= $true )
& ( ( X2 @ X4 )
= $true ) )
& ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X1 @ X3 )
= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
=> ( ( X1 @ X3 )
= $true ) )
=> ! [X4: a] :
( ( ( ( X0 @ X4 )
= $true )
& ( ( X2 @ X4 )
= $true ) )
=> ( ( ( X1 @ X4 )
= $true )
& ( ( X2 @ X4 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
=> ! [X4: a] :
( ( ( X0 @ X4 )
& ( X2 @ X4 ) )
=> ( ( X2 @ X4 )
& ( X1 @ X4 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
=> ! [X3: a] :
( ( ( X0 @ X3 )
& ( X2 @ X3 ) )
=> ( ( X2 @ X3 )
& ( X1 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
=> ! [X3: a] :
( ( ( X0 @ X3 )
& ( X2 @ X3 ) )
=> ( ( X2 @ X3 )
& ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_40_pme) ).
thf(f12,plain,
! [X4: a] :
( ( ( sK1 @ X4 )
!= $true )
| ( ( sK2 @ X4 )
= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f20,plain,
( $false
= ( sK2 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f19]) ).
thf(f19,plain,
( ( $true != $true )
| ( $false
= ( sK2 @ sK3 ) ) ),
inference(fool_paramodulation,[],[f16]) ).
thf(f16,plain,
( ( sK2 @ sK3 )
!= $true ),
inference(subsumption_resolution,[],[f14,f15]) ).
thf(f15,plain,
( $true
= ( sK0 @ sK3 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f14,plain,
( ( $true
!= ( sK0 @ sK3 ) )
| ( ( sK2 @ sK3 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET586^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 13:34:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.37 % (3521)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.15/0.37 % (3525)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.15/0.37 % (3521)First to succeed.
% 0.15/0.37 % (3525)Also succeeded, but the first one will report.
% 0.15/0.37 % (3521)Refutation found. Thanks to Tanya!
% 0.15/0.37 % SZS status Theorem for theBenchmark
% 0.15/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.37 % (3521)------------------------------
% 0.15/0.37 % (3521)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (3521)Termination reason: Refutation
% 0.15/0.37
% 0.15/0.37 % (3521)Memory used [KB]: 5500
% 0.15/0.37 % (3521)Time elapsed: 0.003 s
% 0.15/0.37 % (3521)Instructions burned: 2 (million)
% 0.15/0.37 % (3521)------------------------------
% 0.15/0.37 % (3521)------------------------------
% 0.15/0.37 % (3519)Success in time 0.002 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------